Parsing Circuit Topology in a Deductive System
نویسنده
چکیده
As a step toward automatic circuit understanding, we have developed a method for parsing circuit topology in a deductive system called Duck. A circuit is viewed as a sentence and its elements as words. Generating circuits with specific functions is represented by deductive rules analogous to definite clause grammars. Using those rules, an object circuit is decomposed into a parse tree of functional blocks in terms of logic programming.
منابع مشابه
an Efficient Drive Circuit for Switched Reluctance Motor
The purpose of this paper is to present an efficient converter circuit used to drive switched reluctance motors. It uses the C-dump topology in which the trapped energy in the phase windings is returned to the supply capacitor to be used in the following strokes. In addition to the C-dump topology, it uses two extra feedbacks. One comes from a governor mounted on the shaft of motor which contro...
متن کاملAMOS: A Natural Language Parser Implemented as a Deductive Database in LOLA
In this paper we present the set-oriented bottom-up parsing system AMOS which is a major application of the deductive database system LOLA. AMOS supports the morpho-syntactical analysis of old Hebrew and has now been operationally used by linguists for a couple of years. The system allows the declarative specification of Definite Clause Grammar rules. Due to the set-oriented bottom-up evaluatio...
متن کاملSyntactic Analysis for Natural Language Interfaces - the Integrated Deductive Approach
The objective of our research is the implementation of a German natural language interface for a deductive database system which models a production planning and control system. By means of our approach we suggest a way to overcome the severe drawbacks of interfaces that are designed as loosely coupled filters only. We integrate the interface into the database system itself, that is, the comple...
متن کاملWeighted Deductive Parsing and Knuth's Algorithm
As for algorithms in general, there are significant advantages to specifying parsing algorithms in a modular way (i.e., as the combination of subalgorithms). First, modular specifications often allow simpler implementations. Secondly, if otherwise seemingly distinct types of parser are described in a modular way, the common parts can often be more readily identified, which helps to classify and...
متن کاملبرچسبزنی خودکار نقشهای معنایی در جملات فارسی به کمک درختهای وابستگی
Automatic identification of words with semantic roles (such as Agent, Patient, Source, etc.) in sentences and attaching correct semantic roles to them, may lead to improvement in many natural language processing tasks including information extraction, question answering, text summarization and machine translation. Semantic role labeling systems usually take advantage of syntactic parsing and th...
متن کامل